Denotation of syntax and metaprogramming in contextual modal type theory (CMTT)

نویسندگان

  • Murdoch James Gabbay
  • Aleksandar Nanevski
چکیده

The modal logic S4 can be used via a Curry-Howard style correspondence to obtain a λcalculus. Modal (boxed) types are intuitively interpreted as ‘closed syntax of the calculus’. This λ-calculus is called modal type theory — this is the basic case of a more general contextual modal type theory, or CMTT. CMTT has never been given a denotational semantics in which modal types are given denotation as closed syntax. We show how this can indeed be done, with a twist. We also use the denotation to prove some properties of the system.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Denotation of contextual modal type theory (CMTT): Syntax and meta-programming

The modal logic S4 can be used via a Curry-Howard style correspondence to obtain a λcalculus. Modal (boxed) types are intuitively interpreted as ‘closed syntax of the calculus’. This λ-calculus is called modal type theory — this is the basic case of a more general contextual modal type theory, or CMTT. CMTT has never been given a denotational semantics in which modal types are given denotation ...

متن کامل

Polymorphic Context for Contextual Modality

Through the Curry-Howard isomorphism between logics and calculi, necessity modality in logic is interpreted as types representing program code. Particularly, λ◯, which was proposed in influential work by Davies, and its successors have been widely used as a logical foundation for syntactic meta-programming. However, it is less known how to extend calculi based on modal type theory to handle mor...

متن کامل

Functional Programming With Higher-order Abstract Syntax and Explicit Substitutions

This paper sketches a foundation for programming with higher-order abstract syntax and explicit substitutions based on contextual modal type theory [NPP05]. Contextual modal types not only allows us to cleanly separate the representation of data objects from computation, but allow us to recurse over data objects with free variables. In this paper, we extend these ideas even further by adding fi...

متن کامل

Relating System F and λ2: A Case Study in Coq, Abella and Beluga

We give three formalisations of a proof of the equivalence of the usual, two-sorted presentation of System F and its single-sorted pure type system (PTS) variant λ2. This is established by reducing the typability problem of F to λ2 and vice versa. A key challenge is the treatment of variable binding and contextual information. The formalisations all share the same high level proof structure usi...

متن کامل

A Saturation Method for the Modal Mu-Calculus with Backwards Modalities over Pushdown Systems

We present an algorithm for computing directly the denotation of a modal μcalculus formula χ with backwards modalities over the configuration graph of a pushdown system. Our method gives the first extension of the saturation technique to the full modal μ-calculus with backwards modalities. Finite word automata are used to represent sets of pushdown configurations. Starting from an initial autom...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1202.0904  شماره 

صفحات  -

تاریخ انتشار 2012